Improved algorithms to network p -center location problems
نویسندگان
چکیده
منابع مشابه
Application of computational geometry to network p-center location problems
In this note we showed that a p(≥ 2)-center location problem in general networks can be transformed to the well known Klee’s measure problem [3]. This resulted in an improved algorithm for the continuous case with running time O(mn2 ∗ n log n). The previous best result for the problem is O(mnα(n) log n) where α(n) is the inverse Ackermann function [9]. When the underlying network is a partial k...
متن کاملImproved algorithms for several network location problems with equality measures
We consider single facility location problems with equity measures, de0ned on networks. The models discussed are, the variance, the sum of weighted absolute deviations, the maximum weighted absolute deviation, the sum of absolute weighted di2erences, the range, and the Lorenz measure. We review the known algorithmic results and present improved algorithms for some of these models. ? 2002 Elsevi...
متن کاملImproved Combinatorial Algorithms for Facility Location Problems
We present improved combinatorial approximation algorithms for the uncapacitated facility location problem. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2.414+ in Õ(n/ ) time. This also yields a bicriteria approximation tradeoff of (1 + γ, 1 + 2/γ) for facility cost ve...
متن کاملImproved Parameterized Algorithms for Network Query Problems
Biological networks are often explored through extensive use of network queries. Partial Information Network Queries (PINQ) address the major challenge of analyzing such networks in the absence of certain topological data. In the PINQ problem, we are given a host graph H, modeling a network, and a pattern P, whose topology is only partially known. We seek a subgraph of H that resembles P. In th...
متن کاملDistributed Center-Location Algorithms
Recent multicast routing protocol proposals such as protocol independent multicast (PIM) and core-based trees (CBT) have been based on the notion of group-shared trees. Since construction of a minimal-cost tree spanning all members of a group is difficult, they rely on center-based trees and distribute packets from all sources over a single shortest-path tree rooted at some center. PIM and CBT ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2009.07.003